MAP Inference Via $$\ell _2$$-Sphere Linear Program Reformulation
نویسندگان
چکیده
منابع مشابه
Linear Approximation to ADMM for MAP inference
Maximum a posteriori (MAP) inference is one of the fundamental inference tasks in graphical models. MAP inference is in general NP-hard, making approximate methods of interest for many problems. One successful class of approximate inference algorithms is based on linear programming (LP) relaxations. The augmented Lagrangian method can be used to overcome a lack of strict convexity in LP relaxat...
متن کاملFast Lifted MAP Inference via Partitioning
Recently, there has been growing interest in lifting MAP inference algorithms for Markov logic networks (MLNs). A key advantage of these lifted algorithms is that they have much smaller computational complexity than propositional algorithms when symmetries are present in the MLN and these symmetries can be detected using lifted inference rules. Unfortunately, lifted inference rules are sound bu...
متن کاملSimple MAP Inference via Low-Rank Relaxations
We focus on the problem of maximum a posteriori (MAP) inference in Markov random fields with binary variables and pairwise interactions. For this common subclass of inference tasks, we consider low-rank relaxations that interpolate between the discrete problem and its full-rank semidefinite relaxation. We develop new theoretical bounds studying the effect of rank, showing that as the rank grows...
متن کاملLinear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring R = F2+uF2, where u 2 = 0. The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by using character sums. Combined with Pless power moments and Newton’s Identities, the weight distribution of the Gray image of trace codes was present. Their support structure i...
متن کاملSmooth and Strong: MAP Inference with Linear Convergence
Maximum a-posteriori (MAP) inference is an important task for many applications. Although the standard formulation gives rise to a hard combinatorial optimization problem, several effective approximations have been proposed and studied in recent years. We focus on linear programming (LP) relaxations, which have achieved state-of-the-art performance in many applications. However, optimization of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2020
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-020-01313-2